On ternary self-dual codes of length 24

نویسندگان

  • Jeffrey S. Leon
  • Vera Pless
  • N. J. A. Sloane
چکیده

A hstract-A partial classification is given of the self-dual codes of length 24 over GF(3). The main results are as follows: there are exactly two codes with minimum Hamming distance d = 9; most of the codes have d = 6 and are indecomposable; one code with d = 6 has a trivial automor-phism group (this is the first such self-dual code that has been found); the codes generated by the 59 inequivalent 24 X 24 Hadamard matrices have been investigated and there appear to be only nine inequivalent codes (two with d = 9 and seven with d = 6); and in all there are 27 decomposable codes, at least % indecomposable codes with d = 6, and the total number of inequivalent codes is at least 140. T HE TERNARY self-dual codes with a length less than or equal to 20 have been completely classified in [4], [8], and [ 111. This paper gives a partial classification of the ternary self-dual codes of length 24. The following are the main results. 1) There are exactly 27 decomposable codes (see Section II). 2) Let the numbers q be defined by where the sum is over all indecomposable inequivalent codes C containing exactly 2i codewords of weight 3. Let us say that a code is of ;tvpe ie, +je, if it contains exactly 2i + 8j codewords of weight 3 and these codewords form a code equivalent to ie3@je, (see [ 111). Then q gives the total " mass " of the indecomposable codes of type ie,. These numbers are derived in Section III and are shown in Table I. 3) A computer program has been developed to find the full automorphism group of a code. This program will be described in detail later [6]. 4) There is a close connection between certain ternary self-dual codes of length 24 and the Hadamard matrices of order 24. The latter have recently been classified: there are exactly 59 inequivalent matrices [5]. Any of these matrices generates a self-dual code of length 24 (see Theorem 4). Using the computer program described in 3), we have investigated the codes generated by these 59 matrices and their transposes: there are exactly two codes with minimum

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

2 00 8 A Complete Classification of Ternary Self - Dual Codes of Length 24 Masaaki Harada

Ternary self-dual codes have been classified for lengths up to 20. At length 24, a classification of only extremal self-dual codes is known. In this paper, we give a complete classification of ternary self-dual codes of length 24 using the classification of 24-dimensional odd unimodular lattices.

متن کامل

On extremal self-dual ternary codes of length 48

The notion of an extremal self-dual code has been introduced in 1 . As Gleason 2 remarks onemay use invariance properties of the weight enumerator of a self-dual code to deduce upper bounds on the minimum distance. Extremal codes are self-dual codes that achieve these bounds. The most wanted extremal code is a binary self-dual doubly even code of length 72 and minimum distance 16. One frequentl...

متن کامل

New extremal ternary self-dual codes

Compared to binary self-dual codes, few methods are known to construct ternary self-dual codes. In this paper, a construction method for ternary self-dual codes is presented. Using this method, a number of new extremal ternary self-dual codes are obtained from weighing matrices. In addition, a classification is given for extremal ternary self-dual codes of length 40 constructed from Hadamard ma...

متن کامل

Optimal ternary formally self-dual codes

In this paper, we study ternary optimal formally self-dual codes. Bounds for the highest minimum weight are given for length up to 30 and examples of optimal formally self-dual codes are constructed. For some lengths, we have found formally self-dual codes which have a higher minimum weight than any self-dual code. It is also shown that any optimal formally self-dual [ 10,5,5] code is related t...

متن کامل

Automorphism of order 2p in binary self-dual extremal codes of length a multiple of 24

Automorphisms of order 2p in binary self-dual extremal codes of length a multiple of 24 Abstract Let C be a binary self-dual code with an automorphism g of order 2p, where p is an odd prime, such that g p is a fixed point free involution. If C is extremal of length a multiple of 24 all the involutions are fixed point free, except the Golay Code and eventually putative codes of length 120. Conne...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 27  شماره 

صفحات  -

تاریخ انتشار 1981